One-level reformulation of the bilevel Knapsack problem using dynamic programming
نویسندگان
چکیده
منابع مشابه
Integer Programming Formulation of the Bilevel Knapsack Problem
The Bilevel Knapsack Problem (BKP) is a hierarchical optimization problem in which the feasible set is determined by the set of optimal solutions of parametric Knapsack Problem. In this paper, we propose two stages exact method for solving the BKP. In the first stage, a dynamic programming algorithm is used to compute the set of reactions of the follower. The second stage consists in solving an...
متن کاملBilevel Programming with Knapsack Constraints
A special class of bilevel programming problems with discrete para-metric lower level problems is considered. First, necessary and suucient conditions for the existence of optimal solutions are given. Then, a pseu-dopolynomial exact and a polynomial approximate algorithms for solving the bilevel problem are proposed.
متن کاملOn a Stochastic Bilevel Programming Problem with Knapsack Constraints
In this paper we propose a mixed integer bilevel problem having a probabilistic knapsack constraint in the first level. The problem formulation is mainly motivated by practical pricing and service provision problems as it can be interpreted as a model for the interaction between a service provider and clients. We assume the probability space to be discrete which allows us to reformulate the pro...
متن کاملA Dynamic Programming Heuristic for the Quadratic Knapsack Problem
It is well known that the standard (linear) knapsack problem can be solved exactly by dynamic programming in O(nc) time, where n is the number of items and c is the capacity of the knapsack. The quadratic knapsack problem, on the other hand, is NP-hard in the strong sense, which makes it unlikely that it can be solved in pseudo-polynomial time. We show however that the dynamic programming appro...
متن کاملDynamic programming algorithms for the bi-objective integer knapsack problem
This paper presents two new dynamic programming (DP) algorithms to find the exact Pareto frontier for the bi-objective integer knapsack problem. First, a property of the traditional DP algorithm for the multiobjective integer knapsack problem is identified. The first algorithm is developed by directly using the property. The second algorithm is a hybrid DP approach using the concept of the boun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2013
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2012.09.001